Quantum Multi-object Search Algorithm with the Availability of Partial Information
نویسندگان
چکیده
منابع مشابه
Quantum Multi-object Search Algorithm with the Availability of Partial Information
Consider the unstructured search of an unknown number I of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover’s single-object search algorithm to the multiobject case, and the second part is to solve a counting problem to determine /. In this paper we study the multi-object quantu...
متن کاملQuantum Circuit Design for Multi-Object Search
We study the quantum circuit design using 1-bit and 2-bit unitary gates for the iterations of the multi-object quantum search algorithm. The oracle block is designed in order to efficiently implement any sign-flipping operations. A chief ingredient in the design is the permutation operator which maps a set of search targets to another set on which the sign-flipping operation can be easily done....
متن کاملQuantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system (Partial Diffusion Operator) to propose a quantum search algorithm runs in O( √ N/M ) for searching unstructured list of size N with M matches such that, 1 ≤ M ≤ N . We will show that the performance of the algorithm is more reliable than known quantum search algo...
متن کاملMulti-Qubit Dynamics Quantum Search Algorithm
Following the experimental work [M. W. Johnson, et al. Nature 473, 194 (2011)], we propose a new physical scheme for perfect implementation of quantum search algorithm in presence of the dissipation of qubits. Applying all the required steps for implementing the algorithm, the quantum gates are generated from the suggested model. During a critical portion of quantum annealing, the qubits become...
متن کاملAvailability of Multi-Object Operations
Highly-available distributed storage systems are commonly designed to optimize the availability of individual data objects, despite the fact that user level tasks typically request multiple objects. In this paper, we show that the assignment of object replicas (or fragments, in the case of erasure coding) to machines plays a dramatic role in the availability of such multi-object operations, wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zeitschrift für Naturforschung A
سال: 2001
ISSN: 1865-7109,0932-0784
DOI: 10.1515/zna-2001-1215